Parallel Programming with Multiparty Interactions
نویسنده
چکیده
In this paper, three examples of parallel programming with multiparty interactions are presented. Interacting processes (IP) with multiparty interactions are a programming model for distributed and reactive applications proposed by N. Frances and I. R. Forman 1]. The purpose of this paper is to demonstrate through these examples that IP model is extremely suitable for parallel programming.
منابع مشابه
Parallel Programming with Interacting Processes
In this paper, we argue that interacting processes (IP) with multiparty interactions are an ideal model for parallel programming. The IP model with multiparty interactions was originally proposed by N. Francez and I. R. Forman [1] for distributed programming of reactive applications. We analyze the IP model and provide the new insights into it from the parallel programming perspective. We show ...
متن کاملOn-Demand Coordination of First-Order Multiparty Interactions
First-order multiparty interaction is a key abstraction in the distributed programming model, called Interacting Processes (IP). In this paper, we propose an efficient algorithm for coordinating first-order multiparty interactions on demand. By taking advantage of multithreading, this algorithm requires less messages than the algorithm proposed by Joung and Smolka [1]. It also supports independ...
متن کاملCommunicators: Object-based Multiparty Interactions for Parallel Programming
Contemporary parallel programming languages often provide only few low-level primitives for pairwise communication and synchronization. These primitives are not always suitable for the interactions being programmed. Programming would be easier if it was possible to tailor communication and synchronization mechanisms to t the needs of the application, much as abstract data types are used to crea...
متن کاملDependent Session Types for Evolving Multiparty Communication Topologies
Many application-level distributed protocols and parallel algorithms are dynamic in nature: the number of participants, messages or repetitions is only known at run-time, and the communication topology may be altered during the execution. This paper proposes a dependent type theory for multiparty sessions which can statically guarantee type-safe, deadlock-free multiparty interactions among proc...
متن کاملParameterised Multiparty Session Types
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. This paper proposes a dependent type theory for multiparty sessions which can statically guarantee type-safe, deadlock-free multiparty interactions among processes whose specifications are parameterised by indices. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007